Quantum certificate complexity
نویسندگان
چکیده
منابع مشابه
Quantum Certificate Complexity
Given a Boolean function f , we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC(f) and the quantum certificate complexity QC(f). Using Ambainis’ adversary method, we exactly characterize QC (f) as the square root of RC(f). We then use this result to prove the new relation R0 (f) = O ( Q 2 (f)2 Q 0 (f) log n ) for total f , where R0...
متن کاملSensitivity Versus Certificate Complexity of Boolean Functions
Sensitivity, block sensitivity and certificate complexity are basic complexity measures of Boolean functions. The famous sensitivity conjecture claims that sensitivity is polynomially related to block sensitivity. However, it has been notoriously hard to obtain even exponential bounds. Since block sensitivity is known to be polynomially related to certificate complexity, an equivalent of provin...
متن کاملQuantum Certificate Verification: Single versus Multiple Quantum Certificates
The class MA consists of languages that can be efficiently verified by classical probabilistic verifiers using a single classical certificate, and the class QMA consists of languages that can be efficiently verified by quantum verifiers using a single quantum certificate. Suppose that a verifier receives not only one but multiple certificates. In the classical setting, it is obvious that a clas...
متن کاملBoolean functions with a simple certificate for CNF complexity
In this paper we study relationships between CNF representations of a given Boolean function f and essential sets of implicates of f . It is known that every CNF representation and every essential set must intersect. Therefore the maximum number of pairwise disjoint essential sets of f provides a lower bound on the size of any CNF representation of f . We are interested in functions, for which ...
متن کاملA Tighter Relation between Sensitivity and Certificate Complexity
The sensitivity conjecture which claims that the sensitivity complexity is polynomially related to block sensitivity complexity, is one of the most important and challenging problem in decision tree complexity theory. Despite of a lot of efforts, the best known upper bound of block sensitivity, as well as the certificate complexity, are still exponential in terms of sensitivity: bs( f ) ≤ C( f ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2008
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2007.06.020